Term Declaration Logic and Generalised Composita
نویسنده
چکیده
This paper gives a generalisation of a version of order sorted logic and an abstract axiomatic setting for the treatment of substitution. The two ideas are shown to be related, an equational speciication of term declaration logic being a presentation of a nitary generalised compositum. The axiomatic approach to substitution is compared with some others.
منابع مشابه
Logic Programming Representation of the Compound Term Composition Algebra
The Compound Term Composition Algebra (CTCA) is an algebra with four algebraic op-erators, which can be used to generate the valid (meaningful) compound terms of a given facetedtaxonomy, in an efficient and flexible manner. The positive operations allow the derivation of validcompound terms through the declaration of a small set of valid compound terms. The negativeoperations al...
متن کاملTREATABILITY OF Melia composita USING VACUUM PRESSURE IMPREGNATION
The performance of treated wood in the field is ultimately affected by retention and penetration of preservative in wood. In the present study, a new preservative system ZiBOC and a commercially used preservative copper-chrome-arsenate (CCA) were used for evaluation of treatability of Melia composita by the vacuum pressure method at different pressure levels in unsealed and end sealed specimens...
متن کاملGeneralised Constraint Propagation
Constraint logic programming is often described as logic programming with uni cation replaced by constraint solving over a computation domain. There is another, very di erent, CLP paradigm based on constraint satisfaction, where program-de ned goals can be treated as constraints and handled using propagation. This paper proposes a generalisation of propagation, which enables it to be applied on...
متن کاملA Simple Abstract Semantics for Equational Theories
We show that a suitable abstraction of the notion of term-algebra, called compositum, can be used to capture in a precise mathematical way the intuition that the category of algebras of most (order-sorted) equational theories is completely characterised by their term-model. We also use the relationship between composita and order-sorted equa-tional theories to show that every order-sorted compo...
متن کاملGeneralised Computational Models for Parallel Multilingual Programming
Recently, a number of proposals have appeared in the literature describing various computational models that allow multilingual programming in a parallel or distributed environment. In this paper we briefly review two of these models that seem very promising, namely Linda based on a shared memory model (Tuple Space) and the Program Composition Notation based on concurrent logic programming. We ...
متن کامل